Tensor Rank: Matching Polynomials and Schur Rings
نویسندگان
چکیده
منابع مشابه
Tensor Rank: Matching Polynomials and Schur Rings
We study the polynomial equations vanishing on tensors of a given rank. By means of polarization we reduce them to elements A of the group algebra Q[Sn×Sn] and describe explicitely linear equations on the coefficients of A to vanish on tensors of a given rank. Further, we reduce the study to the Schur ring over the group Sn × Sn that arises from the diagonal conjugacy action of Sn. More closely...
متن کاملHigher order Matching Pursuit for Low Rank Tensor Learning
Low rank tensor learning, such as tensor completion and multilinear multitask learning, has received much attention in recent years. In this paper, we propose higher order matching pursuit for low rank tensor learning problems with a convex or a nonconvex cost function, which is a generalization of the matching pursuit type methods. At each iteration, the main cost of the proposed methods is on...
متن کاملAutomorphism Groups of Schur Rings
In 1993, Muzychuk [18] showed that the rational Schur rings over a cyclic group Zn are in one-to-one correspondence with sublattices of the divisor lattice of n, or equivalently, with sublattices of the lattice of subgroups of Zn. This can easily be extended to show that for any finite group G, sublattices of the lattice of characteristic subgroups of G give rise to rational Schur rings over G ...
متن کاملSchur-finiteness in Λ-rings
We introduce the notion of a Schur-finite element in a λ-ring. Since the beginning of algebraic K-theory in [G57], the splitting principle has proven invaluable for working with λ-operations. Unfortunately, this principle does not seem to hold in some recent applications, such as the K-theory of motives. The main goal of this paper is to introduce the subring of Schur-finite elements of any λ-r...
متن کاملConnections between real Schur polynomials and half order complex Schur polynomials
(where a, , , , = a _ , = 0). Suppose that [possibly after replacement of f ( s ) by f ( s ) l either a,, > 0 for i = 0, 1,. . . , n or a , > 0 , a,, > 0 and a, , , , > 0 for i = 0, 1,. . . , n 1. Then if any of f ( s ) , f , (s) and f,(s) has all zeros in Re[sl < 0, the other two polynomials have this property. In this work, we shall indicate how a parallel result can be obtained for discrete-...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Foundations of Computational Mathematics
سال: 2014
ISSN: 1615-3375,1615-3383
DOI: 10.1007/s10208-014-9190-3